On Fast Bilateral Filtering Using Fourier Kernels
نویسندگان
چکیده
منابع مشابه
Fast O(1) bilateral filtering using trigonometric range kernels
It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithms in the image-processing literature. Along with the spatial filter, the edge-preserving bilateral filter involves an additional range kernel...
متن کاملFiltering algorithms using shiftable kernels
It was recently demonstrated in [4] that the non-linear bilateral filter [18] can be efficiently implemented using an O(1) or constanttime algorithm. At the heart of this algorithm was the idea of approximating the Gaussian range kernel of the bilateral filter using trigonometric functions. In this letter, we explain how the idea in [4] can be extended to few other linear and non-linear filters...
متن کاملReshuffling: a fast algorithm for filtering with arbitrary kernels
A Novel method to accelerate the application of linear filters that have multiple identical coefficients on arbitrary kernels is presented. Such filters, including Gabor filters, gray level morphological operators, volume smoothing functions, etc., are wide used in many computer vision tasks. By taking advantage of the overlapping area between the kernels of the neighboring points, the reshuffl...
متن کاملUsing Cloudy Kernels for Imprecise Linear Filtering
Selecting a particular summative (i.e., formally equivalent to a probability distribution) kernel when filtering a digital signal can be a difficult task. To circumvent this difficulty, one can work with maxitive (i.e., formally equivalent to a possibility distribution) kernels. These kernels allow to consider at once sets of summative kernels with upper bounded bandwith. They also allow to per...
متن کاملInternet Document Filtering Using Fourier Domain Scoring
Most search engines return a lot of unwanted information. A more thorough filtering process can be performed on this information to sort out the relevant documents. A new method called Frequency Domain Scoring (FDS), which is based on the Fourier Transform is proposed. FDS performs the filtering by examining the locality of the keywords throughout the documents. This is examined and compared to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2016
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2016.2539982